Higher-Order Annotated Terms for Proof Search
نویسندگان
چکیده
A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the diierence between pairs of formulae. We deene substitution and uniication for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in Prolog.
منابع مشابه
A Hoare Logic for Call-by-Value Functional Programs
We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style of Hindley and Milner. It is the theoretical basis for a tool that extracts proof obligations out of programs annotated with logical assertions. These proof obligations, expressed in a typed, higher-order logic, are d...
متن کاملExtended Static Checking of Call-by-Value Functional Programs
We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style of Hindley and Milner. It is the theoretical basis for a tool that extracts proof obligations out of programs annotated with logical assertions. These proof obligations, expressed in a typed, higher-order logic, are d...
متن کاملSpecifying Theorem Provers in a Higher-Order Logic Programming Language
Since logic programming systems directly implement search and unification and since these operations are essential for the implementation of most theorem provers, logic programming languages should make ideal implementation languages for theorem provers. We shall argue that this is indeed the case if the logic programming language is extended in several ways. We present an extended logic progra...
متن کاملProof Search with Set Variable
We show how a procedure developed by Bledsoe for automatically nding substitution instances for set variables in higher-order logic can be adapted to provide increased automation in proof search in the Calculus of Constructions (CC). Bledsoe's procedure operates on an extension of rst-order logic that allows existential quantiication over set variables. The method nds maximal solutions for this...
متن کاملA Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming
Higher-order logic programming languages such as Elf extend first-order logic programming in two ways: first-order terms are replaced with (dependently) typed λ-terms and the body of clauses may contain implication and universal quantification. In this paper, we describe tabled higher-order logic programming where some redundant computation is eliminated by memoizing sub-computation and re-usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996